Method and system for dynamic memory management in a user equipment (UE)

ABSTRACT

A method of dynamic memory management in a user equipment (UE) is provided. The method includes receiving, by the UE, transport block size (TBS) information, from a base station (BS), associated with a data packet to be transmitted by the BS to the UE; identifying, by the UE, a plurality of empty bins and a size of each of the plurality of empty bins in a memory of the UE; detecting, by the UE, a presence of one or more empty bins, among the plurality of empty bins in the memory, with a size of each of the one or more empty bins greater than the TBS of the data packet; and allocating, by the UE, a smallest size empty bin, with a size greater than the TBS of the data packet, among the one or more empty bins to the data packet.

CROSS-REFERENCE TO RELATED APPLICATION(S)

This application is based on and claims priority under 35 U.S.C. § 119to Indian Provisional Patent Application No. 201841040460 (PS) filed onOct. 26, 2018 and Indian Complete Patent Application No. 201841040460(CS), filed on Oct. 21, 2019, in the Indian Patent Office, thedisclosure of each of which is herein incorporated by reference.

BACKGROUND 1. Field

The present disclosure generally relates to field of telecommunicationnetwork. Particularly, but not exclusively, the present disclosurerelates to method and system for dynamic memory management in a userequipment (UE).

2. Description of the Related Art

To meet the demand for wireless data traffic, which has increased sincedeployment of 4G communication systems, efforts have been made todevelop an improved 5G or pre-5G communication system. The 5G or pre-5Gcommunication system is also called a “beyond 4G network” or a “post LTE(long term evolution) system”. The 5G communication system is consideredto be implemented in higher frequency (mmWave) bands, e.g., 60 GHzbands, so as to accomplish higher data rates. To decrease propagationloss of the radio waves and increase the transmission distance, thebeamforming, massive multiple-input multiple-output (mMIMO), fulldimensional MIMO (FD-MIMO), array antenna, an analog beam forming, largescale antenna techniques are discussed in 5G communication systems. Inaddition, in 5G communication systems, development for system networkimprovement is under way based on advanced small cells, cloud radioaccess networks (RANs), ultra-dense networks, device-to-device (D2D)communication, wireless backhaul, moving network, cooperativecommunication, coordinated multi-points (CoMP), reception-endinterference cancellation and the like. In the 5G system, hybridfrequency shift keying (FSK) and frequency quadrature amplitudemodulation (FQAM) and sliding window superposition coding (SWSC) as anadvanced coding modulation (ACM), and filter bank multi carrier (FBMC),non-orthogonal multiple access (NOMA), and sparse code multiple access(SCMA) as an advanced access technology have been developed.

The Internet is now evolving to the Internet of things (IoT) wheredistributed entities, such as things, exchange and process informationwithout human intervention. The Internet of everything (IoE), which is acombination of IoT technology and big data processing technology throughconnection with a cloud server, has emerged. As technology elements,such as “sensing technology”, “wired/wireless communication and networkinfrastructure”, “service interface technology”, and “Securitytechnology” have been demanded for IoT implementation, a sensor network,a machine-to-machine (M2M) communication, machine type communication(MTC), and so forth are being researched. Such an IoT environment mayprovide intelligent Internet technology services that create a new valueto human life by collecting and analyzing data generated among connectedthings. IoT may be applied to a variety of fields including smart home,smart building, smart city, smart car or connected cars, smart grid,health care, smart appliances and advanced medical services throughconvergence and combination between existing information technology (IT)and various industrial applications.

In line with this, various attempts have been made to apply 5Gcommunication systems to IoT networks. For example, technologies such asa sensor network, MTC, and M2M communication may be implemented bybeamforming, MIMO, and array antennas. Application of a cloud RAN as theabove-described big data processing technology may also be considered tobe as an example of convergence between the 5G technology and IoTtechnology.

SUMMARY

In accordance with an aspect of the disclosure, a method for dynamicmemory management in a UE is provided. The method includes receiving, bya UE, transport block size (TBS) information, from a base station (BS),associated with a data packet to be transmitted by the BS to the UE,identifying, by the UE, a plurality of empty bins and a size of each ofthe plurality of empty bins in a memory of the UE, detecting, by the UE,a presence of one or more empty bins, among the plurality of empty binsin the memory, with a size of each of the one or more empty bins greaterthan the TBS of the data packet, and allocating, by the UE, a smallestsize empty bin, with a size greater than the TBS of the data packet,among the one or more empty bins to the data packet.

In accordance with another aspect of the disclosure, a UE for dynamicmemory management is provided. The UE includes a processor and a memorycommunicatively coupled to the processor, wherein the memory isconfigured to store processor-executable instructions, which, uponexecution, cause the processor to receive TBS information, from a BS,associated with a data packet to be transmitted by the BS to the UE,identify a plurality of empty bins and a size of each of the pluralityof empty bins in the memory of the UE, detect a presence of one or moreempty bins, among the plurality of empty bins in the memory, with a sizeof each of the one or more empty bins greater than the TBS of the datapacket, and allocate a smallest size empty bin among the one or moreempty bins to the data packet.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other aspects, features, and advantages of certainembodiments of the disclosure will be more apparent from the followingdescription taken in conjunction with the accompanying drawings, inwhich:

FIG. 1A illustrates an architecture of a system for dynamic memorymanagement in a user equipment (UE) in accordance with an embodiment;

FIGS. 1B-1D illustrate a process for dynamic allocation of data packetsin a hybrid automatic repeat request (HARQ) memory in accordance with anembodiment;

FIG. 2A illustrates a block diagram of a UE for dynamic memorymanagement in accordance with an embodiment;

FIGS. 2B-2C illustrate sequence flow diagrams of a process ofcommunication between the UE and base stations BS1 and BS2 in accordancewith an embodiment; and

FIG. 3 illustrates a flowchart of a method of dynamic memory managementin a UE in accordance with an embodiment.

DETAILED DESCRIPTION

In the present document, the word “exemplary” is used herein to mean“serving as an example, instance, or illustration.” Any embodiment orimplementation of the present subject matter described herein as“exemplary” is not necessarily to be construed as preferred oradvantageous over other embodiments.

While the disclosure is susceptible to various modifications andalternative forms, specific embodiments thereof have been shown by wayof example in the drawings and will be described in detail below. Itshould be understood, however that it is not intended to limit thedisclosure to the specific forms disclosed, but on the contrary, thedisclosure is to cover all modifications, equivalents, and alternativesfalling within the scope of the disclosure.

It should be appreciated by those skilled in the art that any blockdiagrams herein represent conceptual views of illustrative systemsembodying the principles of the present subject matter. Similarly, itwill be appreciated that any flow charts, flow diagrams, statetransition diagrams, pseudo code, and the like represent variousprocesses which may be substantially represented in computer readablemedia and executed by a computer or processor, whether such computer orprocessor is explicitly shown.

The terms “comprises”, “comprising”, “includes”, “including” or anyother variations thereof, are intended to cover a non-exclusiveinclusion, such that a setup, device, or method that comprises a list ofcomponents or steps does not include only those components or steps butmay include other components or steps not expressly listed or inherentto such setup or device or method. In other words, one or more elementsin a system or apparatus proceeded by “comprises . . . a” does not,without more constraints, preclude the existence of other elements oradditional elements in the system or method.

In a wireless network, a HARQ protocol is used between BSs and a UE toensure high reliability and high data transmission efficiency whiletransmitting data packets. A UE should have enough memory (also referredas soft buffer space) to store data packets which are not decodedsuccessfully and a size of each buffer space should be greater than orequal to a sum of a maximum TBS of the data packets and redundancyversions. The redundancy versions may be used to decode the datapackets.

The current HARQ protocol implementation allows throughput of the HARQprotocol to be static for a given configuration. For, LTE systems, amemory space is equally divided for 8 HARQ processes and, hence, a UEmay accommodate only 8 HARQ processes. A static memory allocation ofdata packets is calculated based on largest TBS of a data packet andcorresponding redundancy versions. The problem associated with thestatic memory allocation is that the UE may not receive a largest TBSdata packet due to number of downlink frequency carriers carrying thedata packet and, hence, some memory may be wasted or may not beoptimally utilized.

Therefore, a conventional method increases memory of a UE in order toincrease a number of HARQ processes. However, the increase of the memoryin the UE may lead to an increase in a cost of a user device.

The present disclosure discloses a method for dynamic memory managementin a UE which supports a greater number of HARQ processes.

The present disclosure discloses a method which reduces latency of datapackets by effectively utilizing memory of a UE.

The present disclosure increases throughput of a UE in singleconnectivity or multi connectivity scenario across BSs withoutincreasing a size of memory in the UE.

The present disclosure supports high round trip time for providing HARQfeedback for successful receipt and decoding of a data packet.

The present disclosure provides a method and a system for dynamic memorymanagement in a UE. The system comprises one or more BSs and a UE. Theone or more BSs may be configured to transmit data packets to the UE ina cellular network. The data packets may be associated with a HARQprocess. For example, a UE may include, but is not limited to, a mobilephone, a laptop computer and any computing device capable of receivingand transmitting data. A UE may receive TBS information associated witha data packet to be transmitted by a BS, from the BS. A TBS indicatesblock size of a data packet. Thereafter, the UE may identify a pluralityof empty bins and a size of each of the plurality of empty bins in amemory of the UE to accommodate a data packet which is to be receivedfrom the BS. Thereafter, the UE may detect a presence of one or moreempty bins among the plurality of empty bins in the memory wherein asize of each of the one or more empty bins is greater than the TBS ofthe data packet. For example, a TBS associated with a data packet may be50 kb. There may be 5 empty bins in a memory of a UE, namely empty bin1, empty bin 2, empty bin 3, empty bin 4 and empty 5 and a size of eachof the 5 empty bins may be 10 kb, 50 kb, 60 kb, 70 kb, and 50 kb,respectively. The UE may identify that the sizes of empty bin 3 andempty bin 4 are greater than the TBS of the data packet. Therefore, theUE may select one empty bin among empty bin 3 and empty bin 4 with asmallest size and allocate the data packet. In this scenario, the sizeof empty bin 3 may be the smallest as compared with the size of emptybin 4. Hence, the UE may allocate the data packet to empty bin 3. Inanother embodiment, the UE may detect an absence of one or more emptybins among a plurality of empty bins with a size greater than the TBS ofthe data packet. In such a scenario, the UE may reconfigure theplurality of empty bins to create an empty bin with a size greater thanthe TBS of the data packet and thereafter allocate the data packet tothe created empty bin.

FIG. 1A illustrates an architecture of a system 100 for dynamic memorymanagement in a UE 103 in accordance with an embodiment.

Referring to FIG. 1A, the system 100 includes one or more BSs (e.g., BS1101 ₁ to BSn 101 n (alternatively referred as one or more BSs 101) andthe UE 103. For example, the UE 103 may include, but is not limited to,a mobile phone, a laptop computer and any computing device capable ofreceiving and transmitting data. The BS 101 may be a transceiver whichconnects the UE 103 to a central hub and allows connection to a cellularnetwork. In an embodiment, the one or more BSs 101 may be configured totransmit data packets to the UE 103. The present disclosure may employFrequency Division Duplex (FDD) wherein the BS 101 and the UE 103operate at different carrier frequencies for transmitting and receivingdata packets. However, the present disclosure may also be extended to aTime Division Duplexing (TDD) technique wherein the BS 101 and the UE103 may operate at a single frequency for transmitting and receivingdata packets. In an embodiment, the UE 103 may include a HARQ memory forstoring data packets transmitted by the UE 103. In LTE, the HARQ memorymay be equally divided and, hence, 8 data packets may be stored and theUE 103 may take 8 milliseconds to confirm or provide an acknowledgementto the BS 101 on whether the data packets are successfully received anddecoded at the UE 103. However, in the present disclosure, the HARQmemory may be dynamically configured to incorporate more than 8 datapackets.

FIGS. 1B-1D illustrate a process for dynamic allocation of data packetsin a HARQ memory 104 in accordance with an embodiment.

Referring to FIGS. 1B-1D, the BS 101 may transmit the same data packetin each predefined transmission time interval (TTI) to the UE 103 in afirst predefined process, namely a chase combining technique. In anotherembodiment, the BS 101 may transmit a data packet along with one or moreredundant bits to the UE 103 in a second predefined process, namely anincremental redundancy technique. At a first millisecond time instance 1(e.g., TTI 1), the UE 103 may receive a data packet along with one ormore redundant bits. The one or more redundant bits may be used fordecoding the data packet at the UE 103. For example, three redundantbits may be transmitted by the BS 101 along with the data packet to theUE 103. Therefore, the size of a data packet “A” includes a size of thedata packet and a size of the one or more redundant bits. For example,the size of the data packet may be “a”. The size of the first redundantbit may be “a1”, the size of the second redundant bit may be “a2” andthe size of the third redundant bit may be “a3”. Therefore, the size ofthe data packet “A” transmitted is a+a1+a2+a3. The data packet “A” maybe stored in a memory location (also referred as a bin) bin 1.

Similarly, at a second millisecond time instance 2 (e.g., TT2), the UE103 may receive data packet “B”. The data packet “B” may be allocated ina memory location (also referred as bin 2) adjacent to bin 1 which isoccupied by the data packet “A”. Similarly, and so forth, at a twelfthmillisecond time instance 12 (e.g., TT12), the UE 103 may receive datapacket “L”. At a thirteenth millisecond time instance 13 (e.g., TTI 13,the UE 103 may provide an indication as to whether the data packets aresuccessfully received and decoded by the UE 103. For example, at TTI 13,the UE 103 may provide an acknowledgement confirming that the datapackets A, C, F, H, K and L at bins bin 1, bin 3, bin 6, bin 8, bin 11and bin 12 are received and decoded successfully. Since the data packetsA, C, F, H, K and L are received and successfully decoded, the UE 103may remove these data packets from the HARQ memory 104. Upon removal ofthese data packets, the HARQ memory 104 of the UE 103 may be as shown inFIG. 1C. FIG. 1C shows empty bins and non-empty bins. The empty bins bin1, bin 3, bin 6, bin 8, bin 11 and bin 12 indicate free memory spacesince the data packets are removed. The non-empty bins bin 2, bin 4, bin5, bin 7, bin 9 and bin 10 indicate occupied memory space by therespective data packets as the UE 103 has not provided anacknowledgement confirming that these packets are successfully receivedand decoded.

In an embodiment, at TTI 13, the BS 101 may intend to transmit a newdata packet “S” to the UE 103. The UE 103 may receive information of aTBS of the data packet “S” to be transmitted to the UE 103. The TBS ofthe data packet “S” may be 50 kb. The UE 103 may identify a plurality ofempty bins and a size of each of the plurality of empty bins. In thisscenario, the UE 103 may identify that the bins bin 1, bin 3, bin 6, bin8, bin 11 and bin 12 are empty. The size of each of the bins bin 1, bin3, bin 6, bin 8, bin 11 and bin 12 may be 10 kb, 20 kb, 30 kb, 40 kb, 60kb and 70 kb, respectively. In an embodiment, the UE 103 may identifyone or more empty bins with sizes greater than the size of the TBS. Inthis scenario, the size of the data packet “S” is 50 kb. The size of thebins bin 11 and bin 12 are greater than the TBS of the data packet “S”.The UE 103 may allocate the data packet “S” in a smallest size empty binamong the one or more empty bins to the data packet. In this scenario,since, size of the bin 11 is less than the size of bin 12, the datapacket “S” may be allocated in bin 11 as shown in FIG. 1C.

In an embodiment, the UE 103 may detect an absence of one or more emptybins in the HARQ memory 104 wherein a size of the empty bins is greaterthan the TBS of the data packet. For example, the size of each of thebins bin 1, bin 3, bin 6, bin 8, bin 11 and bin 12 may be 10 kb, 20 kb,30 kb, 40 kb, 10 kb and 30 kb, respectively, and the TBS of the datapacket “S” may be 50 kb. As is evident, none of the sizes of the emptybins bin 1, bin 3, bin 6, bin 8, bin 11 and bin 12 is greater than theTBS of the data packer to allocate the data packet. In such a scenario,the UE 103 may reconfigure the plurality of empty bins until an emptybin with a size greater than the TBS of the data packet is created. Thereconfiguration may be performed using a technique which may include,but is not limited to, a linked list technique. Therefore, the bins bin1, bin 3 and bin 6 and may be reconfigured to form a new empty bin. Uponreconfiguring the empty bins bin 1, bin 3 and bin 6, the UE 103 may formthe new empty bin of a size of 60 kb, which is greater than the TBS ofthe data packet. Therefore, the data packet “S” may be allocated to thenew empty bin as shown in FIG. 1D.

In an embodiment, the UE 103 may transmit information associated withone of a presence or an absence of an empty bin with a size greater thanthe TBS of the data packet to one or more associated BS 101 upondetecting a presence or an absence of empty bins with sizes greater thanthe TBS of the data packet in the UE 103. If the BS 101 receivesinformation associated with a presence of an empty bin with a sizegreater than the TBS of the data packet, then the BS 101 may transmitthe data packet to the UE 103.

FIG. 2A illustrates a block diagram of the UE 103 for dynamic memorymanagement in accordance with an embodiment.

Referring to FIG. 2A, the UE 103 may include an input/output (I/O)interface 106, a processor 107 and a memory 111. The I/O interface 106may be configured to receive data packets from the BS 101. The UE 103may also include data 200 and modules 210. For example, the data 200 maybe stored in the memory 111. The data 200 may include TBS data 201, bindata 203 and other data 205. The modules 210 are described below ingreater detail.

The data 200 may be stored in the memory 111 in a form of various datastructures. Additionally, the data 200 can be organized using datamodels, such as relational or hierarchical data models. The other data205 may store data, including temporary data and temporary files,generated by the modules 210 for performing the various functions of theUE 103.

The data 200 stored in the memory 111 may be processed by the modules210 of the UE 103. The modules 210 may be stored within the memory 111.For example, the modules 210 communicatively coupled to the processor107 configured in the UE 103 may also be present outside the memory 111and implemented as hardware. As used herein, the term “modules” mayrefer to an application specific integrated circuit (ASIC), anelectronic circuit, a processor 107 (e.g., shared, dedicated, orgrouped) and the memory 111 that executes one or more software orfirmware programs, a combinational logic circuit, and/or other suitablecomponents that provide the described functionality.

The modules 210 may include, for example, a receiving module 211, anempty bin identification module 213, a detection module 215, anallocation module 217 and other modules 221. The other modules 221 maybe used to perform various miscellaneous functionalities of the UE 103.It will be appreciated that such aforementioned modules 210 may berepresented as a single module or a combination of different modules.

The modules 210, when configured with the functionality defined in thepresent disclosure, will result in a novel hardware.

The receiving module 211 may be configured to receive TBS informationassociated with a data packet from the BS 101. The receiving module 211may receive the TBS of the data packet which is to be transmitted by theBS 101 to the UE 103. The TBS may indicate a size of the data packet.The received TBS of the data packet may be stored as TBS data 201.

The empty bin identification module 213 may be configured to identifythe empty bins in the HARQ memory 104 of the UE 103. The UE 103 mayidentify the plurality of empty bins and a size of each of the pluralityof empty bins. As an example, the plurality of empty bins is that fromwhich the data packets are removed as they have been successfullyreceived and decoded by the UE 103. The information associated withidentified empty bins may be stored as bin data 203.

The detection module 215 may be configured to detect a presence of oneor more empty bins among the plurality of empty bins in the HARQ memory104 wherein the sizes of the one or more empty bins are greater than theTBS of the data packet. For example, there may be three empty bins bin1, bin 2 and bin 3 whose sizes may be 10 kb, 30 kb and 40 kb,respectively. The TBS of the data packet may be 20 kb. The detectionmodule 215 may detect a presence of two empty bins bin 2 and bin 3 withsizes greater than the TBS of the data packet.

The allocation module 217 may allocate the data packet to the smallestsize empty bin among the one or more empty bins. In the exemplaryscenario, the sizes of the empty bins bin 1, bin 2 and bin 3 may be 10kb, 30 kb and 40 kb, respectively. Since the sizes of both empty binsbin 2 and bin 3 are greater than the TBS of the data packet, the datapacket may be allocated to bin 2 or bin 3. The allocation module 217 mayallocate the data packet to the smallest empty bin among the one or moreempty bins. Therefore, the allocation module 217 may allocate the datapacket to the empty bin bin 2 since the size of the empty bin bin 2 issmaller than the size of the empty bin bin 3. Therefore, the data packetmay be allocated in the empty bin bin 2.

There may not be one or more empty bins in the HARQ memory 104 withsizes greater than the TBS of the data packet. For example, the TBS ofthe data packet may be 50 kb and the size of the empty bins bin 1, bin 2and bin 3 may be 10 kb, 30 kb and 40 kb, respectively. In such ascenario, the UE 103 may reconfigure the one or more empty bins. The oneor more empty bins may be reconfigured based on a link list wherein eachof the one or more empty bins are linked using the link list. Due to thereconfiguration, the size of the empty bin is a sum of the size of theplurality of empty bins. For example, the size of the empty bins bin 1,bin 2 and bin 3 may be reconfigured to obtain an empty bin of size 80 kbwhich is greater than the TBS of the data packet which is 50 kb.

The UE 103 may transmit information associated with a presence or anabsence of an empty bin with a size greater than the TBS of the datapacket to the one or more BS 101. The UE 103 may implement the methodsdescribed below for transmitting the information.

Method 1

In an embodiment, the UE 103 may be associated with two base stations BS1 101 ₁ and BS2 101 ₂ as shown in FIG. 2B. FIG. 2B illustrates asequence flow diagram of a process of communication between the UE 103and base stations BS 1 101 ₁ and BS2 101 ₂. Referring to FIG. 2B, the UE103 may transmit information associated with a presence or an absence ofan empty bin using “1 bit” information on a physical uplink controlchannel (PUCCH) between the UE 103 and the base stations BS1 101 ₁ andBS2 101 ₂. The UE 103 may transmit the “1 bit” information “0” upondetecting an absence of an empty bin and transmit “1 bit” information“1” upon detecting a presence of an empty bin in the UE 103. Forexample, the UE 103 may transmit the “1 bit” information “1” to both thebase stations BS1 101 ₁ and BS2 101 ₂ in the PUCCH in steps 230 and 240,respectively. Upon receiving the “1” bit information “1”, both the basestations BS1 101 ₁ and BS2 101 ₂ may continue to retransmit the datapackets to the UE 103 in steps 250 and 260, respectively.

Method 2

In an embodiment, the UE 103 may be associated with two base stationsBS1 101 ₁ and BS 2 101 ₂ as shown in FIG. 2C. FIG. 2C illustrates asequence flow diagram of a process of communication between the UE 103and the base stations BS1 101 ₁ and BS2 101 ₂. Referring to FIG. 2C, theUE 103 may transmit information associated with a presence or an absenceof an empty bin using “1 bit” information on a PUCCH between the UE 103and the base stations, BS1 101 ₁ and BS2 101 ₂. The UE 103 may transmitthe “1 bit” information “0” upon detecting an absence of an empty binand transmit “1 bit” information “1” upon detecting a presence of anempty bin in the UE 103. For example, the UE 103 may transmit the “1bit” information “1” to the base station, BS1 101 ₁ and “1 bit”information “0” to the base station BS2 101 ₂ in the PUCCH in steps 270and 280, respectively. Upon receiving the “1 bit” information “1”, theBS1 101 ₁ may continue to transmit the data packet to the UE 103 at step290. Further, upon receiving the “1 bit” information “0”, the BS2 101 ₂may not transmit the data packet to the UE 103 as there is noavailability of an empty bin for the data packet. If an empty bin with asize greater than the TBS of the data packet is unavailable, the UE 103may not transmit “1 bit” information “0”. The unavailability of the “1bit” information may provide an indication to the UE 103 about anabsence of an empty bin. The UE 103 and the associated BS 101 mayimplement same protocols for dynamic memory management in the UE 103. Insuch a scenario, the UE 103 may not provide “1 bit” information toindicate a presence or an absence of empty bins in the HARQ memory 104of the UE 103.

FIG. 3 illustrates a flowchart of a method of dynamic memory managementin a UE in accordance with an embodiment.

Referring to FIG. 3, the method may be described in a general context ofcomputer executable instructions. Generally, computer executableinstructions may include routines, programs, objects, components, datastructures, procedures, modules, and functions, which perform specificfunctions or implement specific abstract data types.

The order in which the method is described is not intended to beconstrued as a limitation, and any number of the described steps in themethod may be combined in any order to implement the method.Additionally, individual steps may be deleted from the method withoutdeparting from the scope and spirit of the subject matter describedherein. Furthermore, the method may be implemented in any suitablehardware, software, firmware, or combination thereof.

Referring to FIG. 3, at step 301, the method may include receiving TBSinformation from the BS 101. The TBS information may be associated witha data packet which is to be transmitted by the BS 101 to the UE 103.The TBS may indicate a size of the data packet.

At step 303, the method may include identifying a plurality of emptybins and a size of each of the plurality of empty bins in a HARQ memory104 of the UE 103. The UE 103 may include the HARQ memory 104 configuredto store the data packets. The HARQ memory 104 may be configured in theform of a plurality of bins wherein each of the plurality of bins isconfigured to store the data packets. The UE 103 may identify aplurality of empty bins in the memory of the UE 103, if the bins do notinclude any packets. Once the data packet is received by the UE 103 andsuccessfully decoded, the UE 103 may remove the data packet from the binand, hence, the bin may be empty. The UE 103 may also identify a size ofeach of empty bin.

At step 305, the method may include, detecting presence of one or moreempty bins among the plurality of empty bins in the HARQ memory 104wherein a size of each of the one or more empty bins are greater thanthe TBS of the data packet. The UE 103 may compare the TBS of the datapacket and the sizes of the empty bins and detect those empty bins whosesizes are greater than the TBS of the data packet.

At step 307, the method may include allocating a smallest size empty binamong the one or more empty bins to the data packet. For example, theremay be three empty bins with sizes 50 kb, 80 kb and 10 kb. The UE 103may select the empty bin with size 10 kb, since the empty bin with size10 kb is has the smallest size as compared to the other empty bins.

In an embodiment, the UE 103 may detect an absence of one or more emptybins whose sizes are less than a TBS of a data packet. In such ascenario, the UE 103 may reconfigure the plurality of empty bins tocreate an empty bin with a size greater than the TBS of the data packet.The reconfiguration may be performed by correlating empty bins until anempty bin is created whose size is greater than the TBS of the datapacket.

The method disclosed in the present disclosure may be implemented forany wireless device or system such as wireless fidelity (WiFi), narrowband-Internet of Things (NB-IOT), enhanced mobile broadband (eMBB),enhanced machine-type communication (eMTC) and machine to machinecommunication systems.

The terms “an embodiment”, “embodiment” “embodiments”, “the embodiment”,“the embodiments”, “one or more embodiments”, “some embodiments”, and“one embodiment” indicate one or more (but not all) embodiments of thepresent disclosure, unless expressly specified otherwise.

The terms “including”, “comprising”, “having” and variations thereofindicate including but not limited to, unless expressly specifiedotherwise. The enumerated listing of items does not imply that any orall of the items are mutually exclusive, unless expressly specifiedotherwise.

The terms “a”, “an” and “the” indicate one or more, unless expresslyspecified otherwise.

A description of an embodiment with several components in communicationwith each other does not imply that all such components are required. Onthe contrary, a variety of optional components are described above toillustrate the wide variety of possible embodiments of the presentdisclosure.

Where a single device or article is described herein, it will be clearthat more than one device/article (whether they cooperate) may be usedin place of a single device/article. Similarly, where more than onedevice or article is described herein (whether they cooperate), it willbe clear that a single device/article may be used in place of the morethan one device or article or a different number of devices/articles maybe used instead of the shown number of devices or programs. Thefunctionality and/or the features of a device may be alternativelyembodied by one or more other devices which are not explicitly describedas having such functionality/features. Thus, other embodiments of thepresent disclosure need not include the device itself.

Finally, the terms used in the present disclosure are not intended todelineate or circumscribe the present disclosure. It is thereforeintended that the scope of the present disclosure not be limited by adescription, but rather by the appended claims and their equivalents.Accordingly, the present disclosure is intended to be illustrative, butnot limiting, of the scope of the present disclosure, which is set forthin the appended claims.

While the present disclosure has been shown and described with referenceto certain embodiments thereof, it will be apparent to those skilled inthe art that various changes in form and details may be made thereinwithout departing from the scope of the present disclosure as defined bythe appended claims and their equivalents.

What is claimed is:
 1. A method of dynamic memory management in a userequipment (UE), the method comprising: receiving, from a base station(BS), transport block size (TBS) information associated with a datapacket to be transmitted by the BS to the UE; identifying a plurality ofempty bins and a size of each of the plurality of empty bins in a memoryof the UE; determining, from the plurality of empty bins, whether atleast one empty bin with a size greater than the TBS of the data packetexists; and in case that the at least one empty bin with a size greaterthan the TBS of the data packet exists: transmitting, to the BS,information indicating a presence of the at least one empty bin with asize greater than the TBS of the data packet; and allocating, from amongthe at least one empty bin, a smallest size empty bin with a sizegreater than the TBS of the data packet, to the data packet.
 2. Themethod of claim 1, further comprising: in case that the at least oneempty bin with a size greater than the TBS of the data packet does notexist: reconfiguring the plurality of empty bins to create an empty binwith a size greater than the TBS of the data packet; and allocating thecreated empty bin to the data packet.
 3. The method of claim 1, furthercomprising, in case that the at least one empty bin with a size greaterthan the TBS of the data packet does not exist, transmitting informationindicating an absence of the at least one empty bin with a size greaterthan the TBS of the data packet to a first BS and a second BS, in casethat the UE is associated with both of the first BS and the second BS,wherein the information indicating the absence of the at least one emptybin with a size greater than the TBS of the data packet is differentlytransmitted for the first BS and the second BS.
 4. The method of claim1, further comprising receiving the data packet from the BS in case thatthe information indicates the presence of the at least one empty binwith a size greater than the TBS of the data packet.
 5. The method ofclaim 2, wherein reconfiguring the plurality of empty bins comprisescorrelating one or more empty bins with a size smaller than the TBS ofthe data packet until the empty bin with a size greater than the TBS ofthe data packet is created.
 6. The method of claim 2, whereinreconfiguring the plurality of empty bins comprises reconfiguring theplurality of empty bins based on a link list.
 7. The method of claim 1,wherein the data packet is associated with a hybrid automatic repeatrequest (HARQ) process.
 8. The method of claim 1, further comprisingreceiving, from the BS, a same data packet in each of one or morepredefined time intervals in a first predefined hybrid automatic repeatrequest (HARQ) process.
 9. The method of claim 1, further comprisingreceiving, from the BS, the data packet along with one or more redundantbits in each of one or more predefined time intervals in a secondpredefined hybrid automatic repeat request (HARQ) process.
 10. A userequipment (UE) for dynamic memory management, the UE comprising: aprocessor; and a memory communicatively coupled to the processor;wherein the processor is configured to: receive, from a base station(BS), transport block size (TBS) information associated with a datapacket to be transmitted by the BS to the UE; identify a plurality ofempty bins and a size of each of the plurality of empty bins in thememory of the UE; determine, from the plurality of empty bins, whetherat least one empty bin with a size greater than the TBS of the datapacket exists; and in case that the at least one empty bin with a sizegreater than the TBS of the data packet exists: transmit, to the BS,information indicating presence of the at least one empty bin with asize greater than the TBS of the data packet; and allocate, from amongthe at least one empty bin, a smallest size empty bin with a sizegreater than the TBS of the data packet, to the data packet.
 11. The UEof claim 10, wherein the processor is configured to: in case that the atleast one empty bin with a size greater than the TBS of the data packetdoes not exist: reconfigure the plurality of empty bins to create anempty bin with a size greater than the TBS of the data packet; andallocate the created empty bin to the data packet.
 12. The UE of claim10, wherein the processor is configured to, in case that the at leastone empty bin with a size greater than the TBS of the data packet doesnot exist, transmit information indicating an absence of the at leastone empty bin with a size greater than the TBS of the data packet to afirst BS and a second BS, in case that the UE is associated with both ofthe first BS and the second BS, and wherein the information indicatingthe absence of the at least one empty bin with a size greater than theTBS of the data packet is differently transmitted for the first BS andthe second BS.
 13. The UE of claim 10, wherein the processor is furtherconfigured to receive the data packet from the BS in case that theinformation indicates the presence of the at least one empty bin with asize greater than the TBS of the data packet.
 14. The UE of claim 11,wherein the processor is further configured to reconfigure the pluralityof empty bins by correlating one or more empty bins with a size smallerthan the size of the TBS of the data packet until the empty bin with asize greater than the TBS of the data packet is created.
 15. The UE ofclaim 11, wherein the processor is further configured to reconfigure theplurality of empty bins based on a link list.
 16. The UE of claim 10,wherein the data packet is associated with a hybrid automatic repeatrequest (HARQ) process.
 17. The UE of claim 10, wherein the processor isconfigured to receive, from the BS, a same data packet in each of one ormore predefined time intervals in a first predefined hybrid automaticrepeat request (HARQ) process.
 18. The UE of claim 10, wherein theprocessor is configured to receive, from the BS, the data packet alongwith one or more redundant bits in each of one or more predefined timeintervals in a second predefined hybrid automatic repeat request (HARQ)process.